Image Tag Completion by Noisy Matrix Recovery

نویسندگان

  • Zheyun Feng
  • Songhe Feng
  • Rong Jin
  • Anil K. Jain
چکیده

It is now generally recognized that user-provided image tags are incomplete and noisy. In this study, we focus on the problem of tag completion that aims to simultaneously enrich the missing tags and remove noisy tags. The novel component of the proposed framework is a noisy matrix recovery algorithm. It assumes that the observed tags are independently sampled from an unknown tag matrix and our goal is to recover the tag matrix based on the sampled tags. We show theoretically that the proposed noisy tag matrix recovery algorithm is able to simultaneously recover the missing tags and de-emphasize the noisy tags even with a limited number of observations. In addition, a graph Laplacian based component is introduced to combine the noisy matrix recovery component with visual features. Our empirical study with multiple benchmark datasets for image tagging shows that the proposed algorithm outperforms state-of-the-art approaches in terms of both effectiveness and efficiency when handling missing and noisy tags.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Non-local Method for Robust Noisy Image Completion

The problem of noisy image completion refers to recovering an image from a random subset of its noisy intensities. In this paper, we propose a non-local patch-based algorithm to settle the noisy image completion problem following the methodology “grouping and collaboratively filtering”. The target of “grouping” is to form patch matrices by matching and stacking similar image patches. And the “c...

متن کامل

Graph Matrix Completion in Presence of Outliers

Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...

متن کامل

Image tag completion via dual-view linear sparse reconstructions

User-provided textual tags of web images are widely utilized for facilitating image management and retrieval. Yet they are usually incomplete and insufficient to describe the whole semantic content of the corresponding images, resulting in performance degradations of various tag-dependent applications. In this paper, we propose a novel method denoted as DLSR for automatic image tag completion v...

متن کامل

Matrix Completion with Noisy Side Information

We study the matrix completion problem with side information. Side information has been considered in several matrix completion applications, and has been empirically shown to be useful in many cases. Recently, researchers studied the effect of side information for matrix completion from a theoretical viewpoint, showing that sample complexity can be significantly reduced given completely clean ...

متن کامل

Correlation consistency constrained probabilistic matrix factorization for social tag refinement

With the permeation of Web 2.0, large-scale user contributed images with tags are easily available on social websites. However, the noisy or incomplete correspondence between images and tags prohibit us from precise image retrieval and effective management. To tackle this, we propose a social tag refinement method, named as Correlation Consistency constrained Probabilistic Matrix Factorization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014